package com.dq.Week1.day04.method;

import java.util.Scanner;

public class recursiveDemo03 {
    public static int fib(int n)
    {
        if(n==1 || n==2)
        {
            return 1;
        }
        int result = fib(n-1)+fib(n-2);
        return result;
    }
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int sum = fib(n);
        System.out.println(sum);
    }
}
